Network Optimization with Piecewise Linear Convex Costs
نویسندگان
چکیده
The problem of finding the minimum cost multi-commodity flow in an undirected and complete network is studied when the link costs are piecewise linear and convex. The arc-path model and overflow model are presented to formulate the problem. The results suggest that the new overflow model outperforms the classical arc-path model for this problem. The classical revised simplex, Frank and Wolf and a heuristic method are compared for the problem.
منابع مشابه
Network Optimization with Concave Costs
In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.
متن کاملNetwork Optimization with Concave Costs
In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.
متن کاملIEOR 269 , Spring 2010 Integer Programming and Combinatorial Optimization
3 Non-linear Objective functions 4 3.1 Production problem with set-up costs . . . . . . . . . . . . . . . . . . . . . . . . . . 4 3.2 Piecewise linear cost function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3.3 Piecewise linear convex cost function . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.4 Disjunctive constraints . . . . . . . . . . . . . . . . . . . . . ...
متن کاملRebalancing an investment portfolio in the presence of convex transaction costs, including market impact costs
The inclusion of transaction costs is an essential element of any realistic portfolio optimization. In this paper, we consider an extension of the standard portfolio problem in which convex transaction costs are incurred to rebalance an investment portfolio. In particular, we consider linear, piecewise linear, and quadratic transaction costs. The Markowitz framework of mean-variance efficiency ...
متن کاملA Comparison of Mixed - Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
We study a generic minimization problem with separable non-convex piecewise linear costs, showing that the linear programming (LP) relaxation of three textbook mixed-integer programming formulations each approximates the cost function by its lower convex envelope. We also show a relationship between this result and classical Lagrangian duality theory.
متن کامل